Shortest path counting in probabilistic biological networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

algorithms for biobjective shortest path problems in fuzzy networks

we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Shortest-Path Routing in Arbitrary Networks

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D+log N) steps, with high probability. This time bound is optimal up to the additive log N , and it has previously only been reached for bounded-degree leveled networks. Further, we show that the above bound holds also for random routing p...

متن کامل

Bicriteria shortest path in networks of queues

In this paper, I propose a new methodology to find the bicriteria shortest path from the source to the sink node of a network of queues under the steady-state condition. I assume the number of servers in each service station settled in a node of the network is either one or infinity. Moreover, the arc lengths are mutually independent random variables. First, I propose a method to transform each...

متن کامل

The shortest path to complex networks

In these introductory notes for ‘pedestrians’ we describe the current state of the art in the science of complex networks.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2018

ISSN: 1471-2105

DOI: 10.1186/s12859-018-2480-z